Load balancing scheduling mechanism for OpenStack and Docker integration

نویسندگان

چکیده

Abstract With the development of cloud-edge collaborative computing, cloud computing has become crucial in data analysis and processing. OpenStack Docker are important components integration two always attracted widespread attention industry. The scheduling mechanism adopted by existing fusion solution uses a uniform resource weight for all containers, nodes resources on platform is unbalanced under differentiated requirements containers. Therefore, considering different network communication qualities, load-balancing based proposed to meet needs various (CPU, memory, disk, bandwidth) This precise limitation strategy container centralized as basis, it generates exclusive weights containers through filtering stage, weighing stage adaptation, non-uniform memory access (NUMA) lean stage. experimental results show that, compared with Nova-docker Yun, reduces load imbalance within node 57.35% 59.00% average, average between reduced 53.53% 50.90%. can also achieve better balancing without regard bandwidth.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling and Load Balancing

Scheduling and load balancing techniques are crucial for implementing efficient parallel and distributed applications and for making best use of parallel and distributed systems. This includes planning and optimization of resource allocation as well as coping with the dynamics of the systems. They have been subject for research formany decades but remain one of the core topics as the infrastruc...

متن کامل

Topic 3: Scheduling and Load Balancing

An increasing variety of parallel and distributed systems is being developed throughout the world. Parallelism is available at granularities ranging from multi-core processors, via SMPs and clusters, to Grids. However, much of the computing power in these systems remains unusable because adequate algorithms and software for managing these resources are unavailable. Topic 3 is devoted to schedul...

متن کامل

Online Vector Scheduling and Generalized Load Balancing

We give a polynomial time reduction from vector scheduling problem (VS) to generalized load balancing problem (GLB). This reduction gives the first non-trivial online algorithm for VS where vectors come in an online fashion. The online algorithm is very simple in that each vector only needs to minimize the Lln(md) norm of the resulting load when it comes, where m is the number of partitions and...

متن کامل

A Fair and Dynamic Load-Balancing Mechanism

The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more variable and unpredictable traffic patterns. By providing origin-destination (OD) pairs with several possible paths, load-balancing has proven itself an excellent tool to face this uncertainty. Most previous proposals de...

متن کامل

Scheduling algorithms for saving energy and balancing load

In this thesis we study problems of scheduling tasks in computing environments. We consider both the modern objective function of minimizing energy consumption, and the classical objective of balancing load across machines. We first investigate offline deadline-based scheduling in the setting of a single variable-speed processor that is equipped with a sleep state. The objective is that of mini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Cloud Computing

سال: 2023

ISSN: ['2326-6538']

DOI: https://doi.org/10.1186/s13677-023-00445-3